Discrete optimization - PDFSEARCH.IO - Document Search Engine

Discrete optimization
Results: 195

#	Item
71	CME 305: Discrete Mathematics and Algorithms 1 Approximation Algorithms Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:44:41 Operations research Computational complexity theory NP-complete problems Job shop scheduling Mathematical optimization Approximation algorithm Linear programming Algorithm Vertex cover Theoretical computer science Applied mathematics Mathematics
72	Discrete Applied Mathematics–49 Annealed replication: a new heuristic for the maximum clique problem Immanuel M. Bomzea; ∗ , Marco Budinichb , Marcello Pelilloc , Claudio Rossic Add to Reading List Source URL: www.dais.unive.it Language: English - Date: 2002-12-03 08:21:13 NP-complete problems Functional languages Procedural programming languages Recursion Clique problem Mathematical optimization Clique Independent set Dynamical system Theoretical computer science Mathematics Applied mathematics
73	CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:43:36 Combinatorial optimization Minimum spanning tree Spanning tree Job shop scheduling Maximum flow problem Max-flow min-cut theorem Cut Connectivity David Shmoys Graph theory Mathematics Theoretical computer science
74	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 A Combinatorial Maximum Cover Approach to 2D Translational Geometric Covering K. Daniels Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:30 Heuristics Discrete geometry Mathematical optimization Operations research Minkowski addition Polygon Packing problem Triangle Geometry Mathematics Euclidean plane geometry
75	CCCG 2009, Vancouver, BC, August 17–19, 2009 Every Large Point Set contains Many Collinear Points or an Empty Pentagon Zachary Abel∗ Ferran Hurtadok Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:32:39 Convex analysis Convex geometry Euclidean plane geometry Discrete geometry Computational geometry Convex hull Convex set Sylvester–Gallai theorem Convex function Geometry Mathematics Mathematical optimization
76	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On Shortest Paths in Line Arrangements T. Kavitha∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:30 Discrete geometry Euclidean plane geometry Shortest path problem Mathematical optimization Mathematics Theoretical computer science Arrangement of lines
77	Three Dimensional Bin Packing Problem with Variable Bin Height Yong Wu a,b,∗ , Wenkai Li b , Mark Goh b,c , Robert de Souza b a Institute b The Add to Reading List Source URL: www98.griffith.edu.au Language: English - Date: 2011-05-11 13:37:50 Packaging Operations research Discrete geometry Bin packing problem Mathematical optimization Computational complexity theory Packing problem Carton Bounded-error probabilistic polynomial Theoretical computer science Mathematics Applied mathematics
78	Warping Indexes with Envelope Transforms for Query by Humming ∗ Yunyue Zhu Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2011-02-11 18:35:50 Numerical analysis Mathematical optimization Fourier analysis Dynamic programming Dynamic time warping Time series analysis Nearest neighbor search Query by humming Discrete Fourier transform Mathematics Mathematical analysis Algebra
79	Int. J. Production Economics ∎ (∎∎∎∎) ∎∎∎–∎∎∎ Contents lists available at SciVerse ScienceDirect Int. J. Production Economics journal homepage: www.elsevier.com/locate/ijpe Add to Reading List Source URL: isiarticles.com Language: English Theoretical computer science Operations research Mathematical optimization Combinatorial optimization Discrete geometry Bin packing problem Packing problem Genetic algorithm Cutting stock problem Mathematics Applied mathematics Packaging
80	DIMACS Series in Discrete Mathematics and Theoretical Computer Science Using Global Constraints for Local Search Alexander Nareyek Abstract. Conventional ways of using local search are dicult to generalize. Add to Reading List Source URL: www.ai-center.com Language: English - Date: 2010-04-02 04:54:45 Computing Constraint satisfaction Constraint optimization Local search Mathematical optimization Constraint Local consistency Constraint logic programming Constraint programming Software engineering Computer programming

UPDATE